Improving the accuracy of top-N recommendation using a preference model

نویسندگان

  • Jongwuk Lee
  • Dongwon Lee
  • Yeon-Chang Lee
  • Won-Seok Hwang
  • Sang-Wook Kim
چکیده

In this paper, we study the problem of retrieving a ranked list of top-N items to a target user in recommender systems. We first develop a novel preference model by distinguishing different rating patterns of users, and then apply it to existing collaborative filtering (CF) algorithms. Our preference model, which is inspired by a voting method, is well-suited for representing qualitative user preferences. In particular, it can be easily implemented with less than 100 lines of codes on top of existing CF algorithms such as user-based, item-based, and matrix-factorizationbased algorithms. When our preference model is combined to three kinds of CF algorithms, experimental results demonstrate that the preference model can improve the accuracy of all existing CF algorithms such as ATOP and NDCG@25 by 3%–24% and 6%–98%, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Diversity of Top-N Recommendation via Determinantal Point Process

Recommender systems take the key responsibility to help users discover items that they might be interested in. Many recommendation algorithms are built upon similarity measures, which usually result in low intra-list diversity. The deficiency in capturing the whole range of user interest often leads to poor satisfaction. To solve this problem, increasing attention has been paid on improving the...

متن کامل

Adaptive preference elicitation for top-K recommendation tasks using GAI-networks

The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the user’s preferences. In this way we must devise elicitation strategies that focus on the most important questions and at the same time do not need to enumerate the outcome space. In this paper we focus on adaptive elicit...

متن کامل

Modeling Users' Dynamic Preference for Personalized Recommendation

Modeling the evolution of users’ preference over time is essential for personalized recommendation. Traditional time-aware models like (1) timewindow or recency based approaches ignore or deemphasize much potentially useful information, and (2) time-aware collaborative filtering (CF) approaches largely rely on the information of other users, thus failing to precisely and comprehensively profile...

متن کامل

Accurate and Diverse Recommendations Based on Communities of Interest and Trustable Neighbors

Recommender systems are a critical component of e-commerce websites. Considering the users’ complete spectrum of interests, the limitation of current research on recommender systems lies in that they have only paid attention to improving the accuracy of recommendation algorithms while neglected the diversification of recommendations. In this paper, we integrated a user preference matching algor...

متن کامل

Learning Personalized Preference of Strong and Weak Ties for Social Recommendation

Recent years have seen a surge of research on social recommendation techniques for improving recommender systems due to the growing influence of social networks to our daily life. The intuition of social recommendation is that users tend to show affinities with items favored by their social ties due to social influence. Despite the extensive studies, no existing work has attempted to distinguis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Sci.

دوره 348  شماره 

صفحات  -

تاریخ انتشار 2016